Bilevel Optimization Problems with Vectorvalued Objective Functions in Both Levels

نویسندگان

  • S. DEMPE
  • S. FRANKE
چکیده

Bilevel optimization problems with multivalued objective functions in both levels are first replaced by a problem with a parametric lower level using a convex combination of the lower level objectives. Thus a nonconvex multiobjective bilevel optimization problem arises which is then transformed into a parametric bilevel programming problem. The investigated problem has been considered in the paper [11] using ideas from fuzzy optimization. It is one goal to correct some of the wrong ideas in the paper [11].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

متن کامل

A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

متن کامل

Bilevel derivative-free optimization and its application to robust optimization

We address bilevel programming problems when the derivatives of both the upper and the lower level objective functions are unavailable. The core algorithms used for both levels are trust-region interpolation-based methods, using minimum Frobenius norm quadratic models when the number of points is smaller than the number of basis components. We take advantage of the problem structure to derive c...

متن کامل

Methods for solving the bilevel optimization problems

1. Introduction. Nowadays, the bilevel optimization problems, arising in various applications [1, 2], seem to be one of the most attractive fields for many experts [1, 3, 4, 5]. Bilevel problems are such optimization problems, which – side by side with ordinary constraints such as equalities and inequalities [6] – include a constraint described as an optimization subproblem, called the lower-le...

متن کامل

Solving Multi-objective Linear Bilevel Multi-follower Programming Problem

———————————————————————————————Abstract In sciences and industries such as signal optimization, traffic assignment, economic market and etc, many problems have been modeled by bilevel programming (BLP) problems, where in each level one must optimize some objective functions. There are so many algorithms in order to find the global optimum of the linear version of BLP problems. This paper addres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012